منابع مشابه
The Reverse Greedy Algorithm for the Metric K-Median Problem
The Reverse Greedy algorithm (RGREEDY) for the k-median problem works as follows. It starts by placing facilities on all nodes. At each step, it removes a facility to minimize the total distance to the remaining facilities. It stops when k facilities remain. We prove that, if the distance function is metric, then the approximation ratio of RGREEDY is between (logn/ log logn) and O(logn). 2005...
متن کاملAn Integrated Approach for Collection Center Selection in Reverse Logistics
In this paper, a hybrid multi-criteria decision-making (MCDM)-method and mixed integer linear programming (MILP) approach in order to evaluation of the returned products' collectors along with their ordered quantities, is utilized. Firstly, the most important criteria of collection center in the car industry are identified. Then, in order to evaluate these proposed criteria, a hybrid Fuzzy Deci...
متن کاملEvaluating the Reverse Greedy Algorithm
This paper present two meta heuristics, reverse greedy and future aware greedy, which are variants of the greedy algorithm. Both are based on the observation that guessing the impact of future selections is useful for the current selection. While the greedy algorithm makes the best local selection given the past, future aware greedy makes the best local selection given the past and the estimate...
متن کاملGreedy bi-criteria approximations for k-medians and k-means
This paper investigates the following natural greedy procedure for clustering in the bi-criterion setting: iteratively grow a set of centers, in each round adding the center from a candidate set that maximally decreases clustering cost. In the case of k-medians and k-means, the key results are as follows. • When the method considers all data points as candidate centers, then selecting O(k log(1...
متن کاملBalanced k-Center Clustering When k Is A Constant
The problem of constrained k-center clustering has attracted significant attention in the past decades. In this paper, we study balanced k-center cluster where the size of each cluster is constrained by the given lower and upper bounds. The problem is motivated by the applications in processing and analyzing large-scale data in high dimension. We provide a simple nearly linear time 4-approximat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2020
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2020.105941